Jhavepop: Visualizing Linked-list Operations in C++ and Java

نویسندگان

  • David Furcy
  • Jeffrey Popyack
چکیده

JHAVEPOP is a program visualization tool specialized in elementary pointer and linkedlist operations. JHAVEPOP is a web-started application pre-packaged with ready-made programming exercises in both Java and C++. The only preparation needed by instructors to use JHAVEPOP is telling their students what URL to load in their browsers. Once there, students read the problem statement, enter their program, and interact with an automaticallygenerated, visual representation of the state of memory during program execution. JHAVEPOP has been used at both the high-school and college level. Student feedback indicates that JHAVEPOP is helping them debug their programs faster and with less frustration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Poster Proposal for SIGCSE 2016 Proposers:

The concept of memory management in C programming language is particularly challenging for novice programmers. Consequently, many researchers have proposed program visualization tools to alleviate these difficulties: for example, SeeC is one of the state-of-the-art tools for visualizing the behavior and execution status of C programs. However, three problems (P1–3) remain in SeeC, as well as in...

متن کامل

A comparative evaluation of generic programming in Java and C++

List LinkedList ListIterator Iterator List AbstractCollection <> <> <>

متن کامل

A Recipe for Raw Types

The design of GJ (Bracha, Odersky, Stoutamire and Wadler), an extension of Java with parametric polymorphism, was significantly affected by the issue of compatibility between legacy Java code and new GJ code. In particular, the introduction of raw types made it easier to interface polymorphic code with monomorphic code. In GJ, for example, a polymorphic class List, parameterized by the eleme...

متن کامل

Non-Blocking Doubly-Linked Lists with Good Amortized Complexity

We present a new non-blocking doubly-linked list implementation for an asynchronous sharedmemory system. It is the first such implementation for which an upper bound on amortized time complexity has been proved. In our implementation, operations access the list via cursors. Each cursor is associated with an item in the list and is local to a process. The implementation supports two update opera...

متن کامل

Data structure for representing a graph: combination of linked list and hash table

In this article we discuss a data structure, which combines advantages of two different ways for representing graphs: adjacency matrix and collection of adjacency lists. This data structure can fast add and search edges (advantages of adjacency matrix), use linear amount of memory, let to obtain adjacency list for certain vertex (advantages of collection of adjacency lists). Basic knowledge of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009